Counting Generalized Sum-free Sets
نویسنده
چکیده
We show that the number of subsets of {1, 2, ..., n} with no solution to x1+x2+ ...+xk = y1+y2+ ..+yl for k ≥ 4l−1 is at most c2 where θ = k−l k .
منابع مشابه
On the complexity of finding and counting solution-free sets of integers
Given a linear equation L, a set A of integers is L-free if A does not contain any ‘nontrivial’ solutions to L. This notion incorporates many central topics in combinatorial number theory such as sum-free and progression-free sets. In this paper we initiate the study of (parameterised) complexity questions involving L-free sets of integers. The main questions we consider involve deciding whethe...
متن کاملFinding and Counting MSTD sets
We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if the probability that each element is chosen tends to zero, and ‘explicit’ constructions of large families of MSTD sets. We conclude with some new constructi...
متن کاملCounting Sum-free Sets in Abelian Groups
In this paper we study sum-free sets of order m in finite Abelian groups. We prove a general theorem about independent sets in 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting. As a consequence, we determine the typical structure and asymptotic number of sum-free sets of order m in Abelian groups G whose order ...
متن کاملCounting independent sets in graphs
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to ‘real-life’ combinat...
متن کاملNotes on sum-free and related sets
Our main topic is the number of subsets of 1; n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions. In our earlier paper 8], we considered conditions on sets of positive integers (sum-freeness, Sidon sequences, etc.), and attempted to estimate the number of subsets of 1; n] satisfying each ...
متن کامل